Verification of scope-dependent hierarchical state machines
نویسندگان
چکیده
منابع مشابه
Verification of scope-dependent hierarchical state machines
A hierarchical state machine (Hsm) is a finite state machine where a vertex can either expand to another hierarchical state machine (box) or be a basic vertex (node). Each node is labeled with atomic propositions. We study an extension of such model which allows atomic propositions to label also boxes (Shsm). We show that Shsms can be exponentially more succinct than Shsms and verification is i...
متن کاملVerification of Succinct Hierarchical State Machines
A hierarchical state machine (HSM) is a finite state machine where a vertex can either expand to another hierarchical state machine (box ) or be a basic vertex (node). Each node is labeled with atomic propositions. We study an extension of such model which allows atomic propositions to label also boxes (SHSM). We show that SHSMs can be exponentially more succinct than HSMs, and verification is ...
متن کاملCommunicating Hierarchical State Machines
Hierarchical state machines are nite state machines whose states themselves can be other machines. In spite of their popularity in many modeling tools for software design, very little is known concerning their complexity and expressiveness. In this paper, we study these questions for hierarchical state machines as well as for communicating hierarchical state machines, that is, nite state machin...
متن کاملHierarchical and Recursive State Machines with Context-Dependent Properties
Hierarchical and recursive state machines are suitable abstract models for many software systems. In this paper we extend a model recently introduced in literature, by allowing atomic propositions to label all the kinds of vertices and not only basic nodes. We call the obtained models context-dependent hierarchical/recursive state machines. We study on such models cycle detection, reachability ...
متن کاملReconfigurable Hierarchical Finite State Machines
The paper suggests design methods for reconfigurable hierarchical finite state machines (RHFSM), which possess two following important features: 1) they enable the control algorithm to be divided in modules providing direct support for “divide and conquer” strategy; 2) they can be reconfigured both statically and dynamically. Run-time reconfiguration permits virtual control systems to be constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2008
ISSN: 0890-5401
DOI: 10.1016/j.ic.2008.03.017